Splitting Trees and Partition Refinement in Real-Time Model Checking
نویسندگان
چکیده
This paper discusses model checking of real-time systems. A novel aspect of our approach is the unconventional approach to deal with representing symbolic state spaces. The representation does not use a canonical form for representing symbolic nodes. Instead it applies an alternative representation based on splitting trees. Unlike often used canonical representations, this representation is tailored for the type of exploration algorithm that we apply, namely an algorithm based on partition refinement.
منابع مشابه
Verification of Complex Real-Time Systems using Rewriting Logic
This paper presents a method for model checking dense complex real-time systems. This approach is implemented at the meta level of the Rewriting Logic system Maude. The dense complex real-time system is specified using a syntax which has the semantics of timed automata and the property is specified with the temporal logic TLTL (Timed LTL). The well known timed automata model checkers Kronos and...
متن کاملFine-Grain Abstraction and Sequential Don’t Cares for Large Scale Model Checking
Abstraction refinement is a key technique for applying model checking to the verification of real-world digital systems. In previous work, the abstraction granularity is often limited at the state variable level, which is too coarse for verifying industrial-scale designs. In this paper, we propose a finer grain abstraction in which intermediate variables are selectively inserted to partition la...
متن کاملCombining Formal Refinement and Model Checking for Real-Time Systems Verification
We present a framework which combines model checking and theorem prover based refinement for the design of real-time systems focusing on the refinement step when annotating the state-oriented model with timing information. Our verification flow starts from a cycle-accurate finite state machine for the RAVEN model checker and present a translation which efficiently transforms the model to the B ...
متن کاملVerification of Programs with Complex Data
In this thesis, we discuss methods of model checking of infinite-state space systems based on symbolic verification—in particular, we concentrate on the use of the so-called regular tree model checking. As a part of our original contribution, we first present abstract regular tree model checking (ARTMC), a technique based on a combination of regular tree model checking with an automated abstrac...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کامل